//
// Created by DengLibin on 2018/12/16 0016.
//

#include <iostream>
using namespace std;

//求余数
int getYuShu(int m, int n)
{

    return m - (m / n) * n;
}

//求两个数的最大公约数
int getGongYueShu(int m, int n)
{
    if (m < n)
    {
        int temp = n;
        n = m;
        m = temp;
    }
    int x = getYuShu(m, n);
    if (x != 0)
    {
        return getGongYueShu(n, x);
    }
    else
    {
        return n;
    }
}

int main43()
{
    cout << getYuShu(544, 119)<<endl;
    cout << getGongYueShu(119, 544);
    getchar();
    return 0;
}